Multidimensional matrices uniquely recovered by their lines

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Invariant multidimensional matrices

In [AO] the authors study Steiner bundles via their unstable hyperplanes and proved that (see [AO], Tmm 5.9) : A rank n Steiner bundle on Pn which is SL(2,C) invariant is a Schwarzenberger bundle. In this note we give a very short proof of this result based on Clebsch-Gordon problem for SL(2,C)modules.

متن کامل

On Circulants Uniquely Characterized by their Independence Polynomials

In [18], Farrell and Whitehead investigate circulant graphs that are uniquely characterized by their matching and chromatic polynomials (i.e., graphs that are “matching unique” and “chromatic unique”). They develop a partial classification theorem, by finding all matching unique and chromatic unique circulants on n vertices, for each n ≤ 8. In this paper, we explore circulant graphs that are un...

متن کامل

Knowledge Synthesis on Multidimensional Matrices

The tables containing the optimal decisions obtained when solving real decision-making problems under uncertainty are often extremely large. This raises problems related not only to the storage and management of so much information, but also to the use of these tables for knowledge retrieval and reasoning explanation purposes. In this paper, we propose turning the tables into minimum storage mu...

متن کامل

Simulation of coupled transmission lines by multidimensional wave digital filters

MULTIDIMENSIONAL WAVE DIGITAL FILTERS Herbert Krauss Telecommunications Institute University of Erlangen-Nuremberg Cauerstrasse 7, D-91058 Erlangen, Germany [email protected] ABSTRACT In the last few years the application of multidimensional wave digital lters to the numerical solution of partial di erential equations (PDEs) was described in several publications for various ph...

متن کامل

Reconstructing surface triangulations by their intersection matrices

The intersection matrix of a simplicial complex has entries equal to the rank of the intersecction of its facets. We prove that this matrix is enough to define up to isomorphism a triangulation of a surface.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2013

ISSN: 0024-3795

DOI: 10.1016/j.laa.2012.09.022